Providing Receipt-Freeness in Mixnet-Based Voting Protocols
نویسندگان
چکیده
It had been thought that it is difficult to provide receiptfreeness in mixnet-based electronic voting schemes. Any kind of user chosen randomness can be used to construct a receipt, since a user can prove to a buyer how he had encrypted the ballot. In this paper we propose a simple and efficient method to incorporate receipt-freeness in mixnetbased electronic voting schemes by using the well known re-encryption technique and designated verifier re-encryption proof (DVRP). In our scheme a voter has to prepare his encrypted ballot through a randomization service provided by a tamper resistant randomizer (TRR), in such a way that he finally loses his knowledge on randomness. This method can be used in most mixnet-based electronic voting scheme to provide receipt-freeness.
منابع مشابه
An Efficient Mixnet-based Voting Scheme
Receipt-freeness is an essential security property in electronic voting to prevent vote buying, selling or coercion. In this paper, we propose an efficient mixnet-based receipt-free voting scheme by modifying a voting scheme of Lee et al. The receipt-freeness property is obtained through the randomization service given by a trusted administrator, and assuming that two-way untappable channel is ...
متن کاملA Formal Logic Framework for Receipt-freeness in Internet Voting Protocol
The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, coercion-resistant. Receiptfreeness is a key property. Receipt-freeness means that the voter can't produce a receipt to prove that he votes a special ballot. Its purpose is to protect against vote buying. Form...
متن کاملReceipt-Freeness as a Special Case of Anonymity in Epistemic Logic?
Formal methods have provided us with tools to check both anonymity of protocols and – more specifically – receipt-freeness of voting protocols. One of the frameworks used for proving anonymity is epistemic logic. However, to the best of our knowledge, epistemic logic has never been used to prove receipt-freeness of voting protocols. Still, the concept of indistinguishability used in formalizing...
متن کاملFormalising Receipt-Freeness
Receipt-freeness is the property of voting protocols that a voter cannot create a receipt which proves how she voted. Since Benaloh and Tuinstra introduced this property, there has been a large amount of work devoted to the construction of receipt-free voting protocols. This paper provides a generic and uniform formalism that captures the notion of a receipt. The formalism is then applied to an...
متن کاملAnalysis of Receipt-freeness in the Internet Voting Protocol with Applied Pi Calculus
The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, and coercion-resistance. Privacy describes the fact that a particular vote in a particular way is not revealed to anyone. Receipt-freeness means that the voter can not produce a receipt to prove that he votes ...
متن کامل